Priority ranking and minimal disagreement : a weak ordering model

Minimal (Disagreement About) Semantics

Event Ordering with a Generalized Model for Sieve Prediction Ranking

This paper improves on several aspects of a sieve-based event ordering architecture, CAEVO (Chambers et al., 2014), which creates globally consistent temporal relations between events and time expressions. First, we examine the usage of word embeddings and semantic role features. With the incorporation of these new features, we demonstrate a 5% relative F1 gain over our replicated version of CA...

The Minimal Disagreement Parity Problem as a Hard Satisfiability Problem

One common approach to generating hard instances for SAT algorithms is to encode other NP-complete problems into SAT. An obvious problem with this approach is that many NP-complete problems are trivially solvable in the average case [4]. One solution to this problem is to choose problem classes which are randomly self-reducible. As we show in section 3, randomly self-reducible problems are as h...

Ranking and ordering problems of spanning trees

Each spanning tree T of an undirected graph G = (V,E) is represented by a vertex in the tree graph ofG. Two of these ‘spanning tree’ vertices are connected by an edge if and only if the corresponding spanning trees are related by an edge swap. This definition can also be extended to undirected weighted graphs G = (V,E, w) and weighted spanning trees. A couple of questions have arisen regarding ...

Matching With Minimal Priority Rights

I study two prominent strategyproof matching rules when strict priorities over objects are given exogenously: the Deferred Acceptance Rule (DA) and the Top Trading Cycle Rule With Inheritance (TTC). It is well known that the DA rule is stable while the TTC rule is efficient, but not vice versa, and that these two properties cannot be reconciled. The primary innovation of the paper is the introd...